GPU-Accelerated Rendering of Unbounded Nonlinear Iterated Function System Fixed Points
نویسنده
چکیده
Nonlinear functions, including nonlinear iterated function systems, have interesting fixed points. We present a non-Lipschitz theoretical approach to nonlinear function system fixed points which generalizes to non-contractive functions, compare several methods for evaluating such fixed points on modern graphics hardware, and present a nonlinear generalization of Barnsley’s Deterministic Iteration Algorithm. Unlike the many existing randomized rendering algorithms, this deterministic method avoids noncoherent branching and memory access, and takes advantage of programmable texture mapping hardware. Together with the performance potential of modern graphics hardware, this allows us to animate high quality and high definition fixed points in real time.
منابع مشابه
Chaotic property for non-autonomous iterated function system
In this paper, the new concept of non-autonomous iterated function system is introduced and also shown that non-autonomous iterated function system IFS(f_(1,∞)^0,f_(1,∞)^1) is topologically transitive for the metric space of X whenever the system has average shadowing property and its minimal points on X are dense. Moreover, such a system is topologically transitive, whenever, there is a point ...
متن کاملWeak $F$-contractions and some fixed point results
In this paper we define weak $F$-contractions on a metric space into itself by extending $F$-contractions introduced by D. Wardowski (2012) and provide some fixed point results in complete metric spaces and in partially ordered complete generalized metric spaces. Some relationships between weak $F$-contractions and $Fi$-contractions are highlighted. We also give some application...
متن کاملGPU-based real time FRep ray casting
A new method is presented for rendering general FRep (functionally represented) models using GPU-accelerated ray casting. We use the GPU acceleration for all computations in the rendering algorithm: ray-surface intersection calculation, function evaluation, and normal vector computation. Performing geometric intersection calculations in parallel with shading allows us to combine the whole proce...
متن کاملCoincidence point and common fixed point results via scalarization function
The main purpose of this paper is to obtain sufficient conditions for existence of points of coincidence and common fixed points for three self mappings in $b$-metric spaces. Next, we obtain cone $b$-metric version of these results by using a scalarization function. Our results extend and generalize several well known comparable results in the existing literature.
متن کاملSingle-Pass Point Rendering and Transparent Shading
Hardware accelerated point-based rendering (PBR) algorithms have suffered in the past from multiple rendering passes; possibly a performance limiting factor. Two passes over the point geometry have been necessary because a first visibility-splatting pass has been necessary for conservative ε-z-buffer visibility culling in the following point-interpolation rendering pass. This separation into vi...
متن کامل